Conjunctive normal form - PDFSEARCH.IO - Document Search Engine

Conjunctive normal form
Results: 92

#	Item
41	Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask) Tom´ aˇs Balyo1 , Andreas Fr¨ohlich2 , Marijn J. H. Heule3 , Armin Biere2 ? Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 10:00:09 Automated theorem proving Logic in computer science Propositional calculus NP-complete problems Logic programming Boolean satisfiability problem Unit propagation Conjunctive normal form Resolution Theoretical computer science Mathematics Mathematical logic
42	EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-26 11:40:37 Logic programming Conjunctive normal form Local search Boolean satisfiability problem DPLL algorithm Theoretical computer science Constraint programming Declarative programming
43	Trimming while Checking Clausal Proofs Marijn J.H. Heule, Warren A. Hunt, Jr., and Nathan Wetzler The University of Texas at Austin Abstract—Conflict-driven clause learning (CDCL) satisfiability solvers can emit more t Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 11:58:01 Unsatisfiable core Conjunctive normal form Resolution Five lemma Theorem Logic programming Unit propagation Automated proof checking Boolean satisfiability problem Logic Mathematics Automated theorem proving
44	Clause Elimination Procedures for CNF Formulas Marijn Heule1 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Department of Software Technology, Delft University of Technology, The Netherlands Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:34:30 Automated theorem proving Mathematical logic Propositional calculus Logic in computer science NP-complete problems Conjunctive normal form Resolution Boolean satisfiability problem Unit propagation Theoretical computer science Logic Mathematics
45	Revisiting Hyper Binary Resolution Marijn J.H. Heule1,3 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Department of Computer Science, The University of Texas at Austin, United States Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 14:06:39 Automated theorem proving Logic in computer science NP-complete problems Conjunctive normal form Resolution Unit propagation Boolean satisfiability problem Literal Transitivity Theoretical computer science Mathematical logic Mathematics
46	Covered Clause Elimination Marijn Heule∗ TU Delft, The Netherlands Matti J¨arvisalo† Univ. Helsinki, Finland Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:30:47 Automated theorem proving Logic in computer science NP-complete problems Logic programming Conjunctive normal form Boolean satisfiability problem Unit propagation Resolution Clause Theoretical computer science Mathematical logic Mathematics
47	Blocked Clause Elimination and its Extensions Marijn J. H. Heule∗ joint work with Matti J¨arvisalo and Armin Biere Abstract Boolean satisfiability (SAT) has become a core technology in many application Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 08:16:51 NP-complete problems Conjunctive normal form Automated theorem proving Boolean satisfiability problem Resolution Logic programming 2-satisfiability Theoretical computer science Mathematics Applied mathematics
48	A Unified Proof System for QBF Preprocessing? Marijn J.H. Heule1 , Martina Seidl2 , and Armin Biere2 1 Department of Computer Science, The University of Texas at Austin, USA [removed] Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 09:57:45 Automated theorem proving Boolean algebra Mathematical logic Resolution True quantified Boolean formula Conjunctive normal form Limit Literal Model theory Mathematics Logic Theoretical computer science
49	On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas ˇ ˇ Ondˇrej Cepek and Stefan Add to Reading List Source URL: www.cs.uic.edu Language: English - Date: 2013-12-21 14:10:02 Logic in computer science Boolean algebra Complexity classes NP-complete problems Conjunctive normal form Computational problems 2-satisfiability Boolean satisfiability problem Disjunctive normal form Theoretical computer science Computational complexity theory Applied mathematics
50	Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas Inaugural-Dissertation zur Erlangung des Doktorgrades Add to Reading List Source URL: kups.ub.uni-koeln.de Language: English - Date: 2011-03-28 06:57:24 NP-complete problems Logic in computer science Complexity classes Boolean algebra 2-satisfiability Boolean satisfiability problem Conjunctive normal form Outerplanar graph Planar graph Theoretical computer science Graph theory Computational complexity theory